Two Optimal Value Functions in Parametric Conic Linear Programming
نویسندگان
چکیده
We consider the conic linear program given by a closed convex cone in an Euclidean space and matrix, where vector on right-hand side of inequality constraint defining objective function are subject to change. Using strict feasibility condition, we prove locally Lipschitz continuity obtain some differentiability properties optimal value problem under right-hand-side perturbations. For perturbations function, similar obtained assumption saying that both primal dual strictly feasible.
منابع مشابه
Linear Conic Programming
A little story in the development of semidefinite programming. One day in 1990, I visited the Computer Science Department of the University of Min-nesota and met a young graduate student, Farid Alizadeh. He, working then on combinatorial optimization, introduced me " semidefinite optimization " or linear programming over the positive definite matrix cone. We had a very extensive discussion that...
متن کاملSubgradients of value functions in parametric dynamic programming
We study in this paper the first-order behavior of value functions in parametric dynamic programming with linear constraints and nonconvex cost functions. By establishing an abstract result on the Fréchet subdifferential of value functions of parametric mathematical programming problems, some new formulas on the Fréchet subdifferential of value functions in parametric dynamic programming are ob...
متن کاملSubgradients of value functions in parametric dynamic programming q
We study in this paper the first-order behavior of value functions in parametric dynamic programming with linear constraints and nonconvex cost functions. By establishing an abstract result on the Fréchet subdifferential of value functions of parametric mathematical programming problems, some new formulas on the Fréchet subdifferential of value functions in parametric dynamic programming are ob...
متن کاملLinear discrimination using second order conic programming
We propose a new p-norm linear discrimination model that generalizes the model of Bennett and Mangasarian (1992) and reduces to linear programming problem with p-order conic constraints. We demonstrate that the developed model possesses excellent methodological and computational properties (e.g., it does not allow for a null separating hyperplane when the sets are linearly separable, etc). The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2021
ISSN: ['0022-3239', '1573-2878']
DOI: https://doi.org/10.1007/s10957-021-01959-z